On Generalizations and Improvements to the Shannon-Fano Code
نویسندگان
چکیده
منابع مشابه
Nonextensive Generalizations of the Jensen-Shannon Divergence
Convexity is a key concept in information theory, namely via the many implications of Jensen’s inequality, such as the non-negativity of the Kullback-Leibler divergence (KLD). Jensen’s inequality also underlies the concept of Jensen-Shannon divergence (JSD), which is a symmetrized and smoothed version of the KLD. This paper introduces new JSD-type divergences, by extending its two building bloc...
متن کاملon the relationship between self- regulated learning strategies use and willingness to communicate in the context of writing
این تحقیق به منظور بررسی رابطه بین میزان استراتژیهای خود-تنظیم شده یادگیری و تمایل به ایجاد ارتباط دانشجویان زبان انگلیسی انجام شده است.علاوه بر این،روابط و کنش های موجود بین ریزسنجه های استراتژیهای خود-تنظیم شده یادگُیری ، مهارت نگارش و تمایل به برقراری ارتباط و همچنین تاٍثیرجنسیت دانشجویان زبان انگلیسی در استراتژیهای خود-تنظیم شده یادگیری و تمایل به برقراری ارتباط آنها مورد بررسی قرار گرفته شد.
15 صفحه اولRecent Improvements to TRIGLAV Code
TRIGLAV code was developed for TRIGA research reactor calculations and is based on twodimensional diffusion equation. The main purpose of the program is calculation of the fuel elements burn-up. Calculated core burn-up and excess reactivity results are compared with experimental values. New control rod model is introduced and tested in this paper. Calculated integral control rod worth and calcu...
متن کاملAsymptotic Average Redundancy of Huffman (and Shannon-Fano) Block Codes
We study the redundancy of Huffman code (which, incidentally, is as old as the author of this paper). It has been known from the inception of this code that in the worst case Huffman code redundancy defined as the excess of the code length over the optimal (ideal) code length is not more than onc. Over more than forty years, insightful, elegant and useful constructions have been set up to deter...
متن کاملMining Sequential Patterns: Generalizations and Performance Improvements
The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user-speci ed minimum support, where the support of a pattern is the number of data-sequences that contain the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Technica Jaurinensis
سال: 2017
ISSN: 2064-5228,1789-6932
DOI: 10.14513/actatechjaur.v10.n1.405